Queue Layouts of Planar 3-Trees
نویسندگان
چکیده
منابع مشابه
Queue Layouts of Hypercubes
A queue layout of a graph consists of a linear ordering σ of its vertices, and a partition of its edges into sets, called queues, such that in each set no two edges are nested with respect to σ. We show that the n-dimensional hypercube Qn has a layout into n−blog2 nc queues for all n ≥ 1. On the other hand, for every ε > 0 every queue layout of Qn has more than ( 1 2 − ε)n−O(1/ε) queues, and in...
متن کاملEfficient planar embedding of trees for VLSI layouts
The use of planar polygonal partitioning schemes for planar embedding of tree structures is examined. Two layout designs based on recursive square and triangular decompositions are described for trees having branching factors of k 2 and k 2 1, where k is an integer. The former design allocates the same amount of area to nodes at all levels and requires a total area linear in the number N of nod...
متن کاملStack and Queue Layouts of Halin Graphs
A Halin graph the union of a tree with no degree-2 vertices and a cycle on the leaves of the tree. This paper examines the problem of laying out Halin graphs using stacks and queues. A k-stack (k-queue) layout of a graph consists of a linear ordering of the vertices along with an assignment of each edge to one of k stacks (queues). The ordering and the edge assignments must be made such that if...
متن کاملStack and Queue Layouts of Posets
The stacknumber (queuenumber) of a poset is defined as the stacknumber (queuenumber) of its Hasse diagram viewed as a directed acyclic graph. Upper bounds on the queuenumber of a poset are derived in terms of its jumpnumber, its length, its width, and the queuenumber of its covering graph. A lower bound of Ω( √ n) is shown for the queuenumber of the class of n-element planar posets. The queuenu...
متن کاملQueue Layouts of Graph Products and Powers
A k-queue layout of a graph G consists of a linear order σ of V (G), and a partition of E(G) into k sets, each of which contains no two edges that are nested in σ. This paper studies queue layouts of graph products and powers.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2020
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-020-00697-4